A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery

Here we discuss the lot sizing problem of product returns and remanufacturing. Let us consider a forecast of demands and product returns over a finite planning horizon — the problem is to determine an optimal production plan. This consists of either manufacturing new products or remanufacturing returned units, and in this way meets both demands at minimum costs. The costs of course are the fixed set-up expenses associated with manufacturing and/or remanufacturing lots and also the inventory holding costs of stocks kept on hand. In addition to showing that a general instance of this problem is NP-Hard, we develop an alternative mixed-integer model formulation for this problem and contrast it to the formulation commonly used in the literature. We show that when integrality constraints are relaxed, our formulation obtains better bounds. Our formulation incorporates the fact that every optimal solution can be decomposed into a series of well-structured blocks with distinct patterns in the way in which set-ups for manufacturing and remanufacturing occur. We then construct a dynamic programming based heuristic that exploits the block structure of the optimal solution. We also propose some improvement schemes as well. Finally, our numerical testing shows that the heuristic performs very well as intended. & 2013 Elsevier Ltd. All rights reserved.